Minimizing a Quadratic Over a Sphere

نویسنده

  • William W. Hager
چکیده

A new method, the sequential subspace method (SSM), is developed for the problem of minimizing a quadratic over a sphere. In our scheme, the quadratic is minimized over a subspace which is adjusted in successive iterations to ensure convergence to an optimum. When a sequential quadratic programming iterate is included in the subspace, convergence is locally quadratic. Numerical comparisons with other recent methods are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global convergence of SSM for minimizing a quadratic over a sphere

In an earlier paper [Minimizing a quadratic over a sphere, SIAM J. Optim., 12 (2001), 188–208], we presented the sequential subspace method (SSM) for minimizing a quadratic over a sphere. This method generates approximations to a minimizer by carrying out the minimization over a sequence of subspaces that are adjusted after each iterate is computed. We showed in this earlier paper that when the...

متن کامل

Regression Modeling for Spherical Data via Non-parametric and Least Square Methods

Introduction Statistical analysis of the data on the Earth's surface was a favorite subject among many researchers. Such data can be related to animal's migration from a region to another position. Then, statistical modeling of their paths helps biological researchers to predict their movements and estimate the areas that are most likely to constitute the presence of the animals. From a geome...

متن کامل

SDO relaxation approach to fractional quadratic minimization with one quadratic constraint

In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

متن کامل

On diffeomorphisms over surfaces trivially embedded in the 4-sphere

A surface in the 4-sphere is trivially embedded, if it bounds a 3dimensional handle body in the 4-sphere. For a surface trivially embedded in the 4-sphere, a diffeomorphism over this surface is extensible if and only if this preserves the Rokhlin quadratic form of this embedded surface. AMS Classification 57N10; 57N05, 20F38

متن کامل

Computer-Generated Minimal (and Larger) Response-Surface Designs: (I) The Sphere

Computer-generated designs in the sphere are described which have the minimal (or larger) number of runs for a full quadratic response-surface design. In the case of 3 factors, the designs have 10 through 33 runs; for 4 factors, 15 through 28 runs; for 5 factors, 21 through 33 runs; etc. Some of these designs are listed here in full; the others can be obtained from the authors. The designs were...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2001